Optimal stopping

In mathematics, the theory of optimal stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

Contents

Definition

Stopping rule problems are associated with two objects:

  1. A sequence of random variables X_1, X_2, \ldots, whose joint distribution is something assumed to be known
  2. A sequence of 'reward' functions (y_i)_{i\ge 1} which depend on the observed values of the random variables in 1.:
    y_i=y_i (x_1, \ldots ,x_i)

Given those objects, the problem is as follows:

Examples

Coin tossing (\mathbb{E}(y_i) converges)

You have a fair coin and are repeatedly tossing it. Each time, before it is tossed, you can choose to stop tossing it and get paid (in dollars, say) the average number of heads observed.

You wish to maximise the amount you get paid by choosing a stopping rule. If Xi (for i ≥ 1) forms a sequence of independent, identically distributed random variables with distribution

\text{Bern}\left(\frac{1}{2}\right),

and if

y_i = \frac 1 i \sum_{k=1}^{i} X_k

then the sequences (X_i)_{i\geq 1}, and (y_i)_{i\geq 1} are the objects associated with this problem.

House selling (\mathbb{E}(y_i) does not necessarily converge)
You have a house and wish to sell it. Each day you are offered X_n for your house, and pay k to continue advertising it. If you sell your house on day n, you will earn y_n, where y_n = (X_n - nk).
You wish to maximise the amount you earn by choosing a stopping rule.
In this example, the sequence (X_i) is the sequence of offers for your house, and the sequence of reward functions is how much you will earn.

Secretary problem ((X_i) is a finite sequence)

Main article: Secretary problem

You are observing a sequence of objects which can be ranked from best to worst. You wish to choose a stopping rule which maximises your chance of picking the best object.
Here, if R_1, \ldots, R_n (n is some large number, perhaps) are the ranks of the objects, and y_i is the chance you pick the best object if you stop intentionally rejecting objects at step i, then (R_i) and (y_i) are the sequences associated with this problem. This problem was solved in the early 1960s by several people. An elegant solution to the secretary problem and several modifications of this problem is provided by the more recent odds algorithm of optimal stopping (Bruss algorithm).

Search theory

Main article: Search theory

Economists have studied a number of optimal stopping problems similar to the 'secretary problem', and typically call this type of analysis 'search theory'. Search theory has especially focused on a worker's search for a high-wage job, or a consumer's search for a low-priced good.

References

External links